13 research outputs found
The Disk Layout Problem
Imagine that we keep a daily log of the files that our computer reads from its hard disk. For most computer users the logs of one day compared to the next may be very similar. For example, opening up a commonly used program may require access to the same files in the same order every time that event occurs. We shall call such a sequence of files a trace.
The essence of the problem therefore is: given a set of traces that are expected to be representative of common use, we must rearrange the files on the disk so that the performance is optimized.
Programs called disk defragmenters use these simple principles to rearrange data records on a disk so that each file is contiguous, with no holes or few holes between data records. Some more sophisticated disk defragmenters also try to place related files near each other, usually based on simple static structure rather than a dynamic analysis of the accesses. We are interested in more dynamic defragmentation procedures.
We first consider a 1D model of the disk. We then look at the results from an investigation of the 2D disk model followed by a discussion of caching strategies. Finally we list some of the complications that may need to be addressed in order to make the models more realistic
Fixing numbers for matroids
Motivated by work in graph theory, we define the fixing number for a matroid.
We give upper and lower bounds for fixing numbers for a general matroid in
terms of the size and maximum orbit size (under the action of the matroid
automorphism group). We prove the fixing numbers for the cycle matroid and
bicircular matroid associated with 3-connected graphs are identical. Many of
these results have interpretations through permutation groups, and we make this
connection explicit.Comment: This is a major revision of a previous versio
Higher Dimensional Lattice Chains and Delannoy Numbers
Fix nonnegative integers n1 , . . ., nd, and let L denote the lattice of points (a1 , . . ., ad) ∈ ℤd that satisfy 0 ≤ ai ≤ ni for 1 ≤ i ≤ d. Let L be partially ordered by the usual dominance ordering. In this paper we use elementary combinatorial arguments to derive new expressions for the number of chains and the number of Delannoy paths in L. Setting ni = n (for all i) in these expressions yields a new proof of a recent result of Duichi and Sulanke [9] relating the total number of chains to the central Delannoy numbers. We also give a novel derivation of the generating functions for these numbers in arbitrary dimension
Maximum Difference Extreme Difference Method for Finding the Initial Basic Feasible Solution of Transportation Problems
A Transportation Problem can be modeled using Linear Programming to determine the best transportation schedule that will minimize the transportation cost. Solving a transportation problem requires finding the Initial Basic Feasible Solution (IBFS) before obtaining the optimal solution. We propose a new method for finding the IBFS called the Maximum Difference Extreme Difference Method (MDEDM) which yields an optimal or close to the optimal solution. We also investigate the computational time complexity of MDEDM, and show that it is O(mn)
Area, perimeter, height, and width of rectangle visibility graphs
A rectangle visibility graph (RVG) is represented by assigning to each vertex a rectangle in the plane with horizontal and vertical sides in such a way that edges in the graph correspond to unobstructed horizontal and vertical lines of sight between their corresponding rectangles. To discretize, we consider only rectangles whose corners have integer coordinates. For any given RVG, we seek a representation with smallest bounding box as measured by its area, perimeter, height, or width (height is assumed not to exceed width)
Counting lattice chains and Delannoy paths in higher dimensions
AbstractLattice chains and Delannoy paths represent two different ways to progress through a lattice. We use elementary combinatorial arguments to derive new expressions for the number of chains and the number of Delannoy paths in a lattice of arbitrary finite dimension. Specifically, fix nonnegative integers n1,…,nd, and let L denote the lattice of points (a1,…,ad)∈Zd that satisfy 0≤ai≤ni for 1≤i≤d. We prove that the number of chains in L is given by 2nd+1∑k=1kmax′∑i=1k(−1)i+kk−1i−1nd+k−1nd∏j=1d−1nj+i−1nj, where kmax′=n1+⋯+nd−1+1. We also show that the number of Delannoy paths in L equals ∑k=1kmax′∑i=1k(−1)i+k(k−1i−1)(nd+k−1nd)∏j=1d−1(nd+i−1nj). Setting ni=n (for all i) in these expressions yields a new proof of a recent result of Duchi and Sulanke [9] relating the total number of chains to the central Delannoy numbers. We also give a novel derivation of the generating functions for these numbers in arbitrary dimension
Bounding and Stabilizing Realizations of Biased Graphs With a Fixed Group
Given a group Γ and a biased graph (G, B), we define a what is meant by a Γ-realization of (G, B) and a notion of equivalence of Γ-realizations. We prove that for a finite group Γ and t ≥ 3, that there are numbers n(Γ) and n(Γ, t) such that the number of Γ-realizations of a vertically 3-connected biased graph is at most n(Γ) and that the number of Γ-realizations of a nonseparable biased graph without a (2Ct , ∅)-minor is at most n(Γ, t). Other results pertaining to contrabalanced biased graphs are presented as well as an analogue to Whittle’s Stabilizer Theorem for Γ-realizations of biased graphs
Bounding and Stabilizing Realizations of Biased Graphs With a Fixed Group
Given a group Γ and a biased graph (G, B), we define a what is meant by a Γ-realization of (G, B) and a notion of equivalence of Γ-realizations. We prove that for a finite group Γ and t ≥ 3, that there are numbers n(Γ) and n(Γ, t) such that the number of Γ-realizations of a vertically 3-connected biased graph is at most n(Γ) and that the number of Γ-realizations of a nonseparable biased graph without a (2Ct , ∅)-minor is at most n(Γ, t). Other results pertaining to contrabalanced biased graphs are presented as well as an analogue to Whittle’s Stabilizer Theorem for Γ-realizations of biased graphs
On cocircuit covers of bicircular matroids
AbstractGiven a graph G, one can define a matroid M=(E,C) on the edges E of G with circuits C where C is either the cycles of G or the bicycles of G. The former is called the cycle matroid of G and the latter the bicircular matroid of G. For each bicircular matroid B(G), we find a cocircuit cover of size at most the circumference of B(G) that contains every edge at least twice. This extends the result of Neumann-Lara, Rivera-Campo and Urrutia for graphic matroids